From Two-Way to One-Way Finite Automata - Three Regular Expression-Based Methods
نویسنده
چکیده
We describe three regular expression-based methods to characterize as a regular language the language defined by a two-way automaton. The construction methods yield relatively simple techniques to directly construct one-way automata that simulate the behavior of two-way automata. The approaches also offer conceptually uncomplicated alternative equivalence proofs of two-way automata and one-way automata, particularly in the deterministic case.
منابع مشابه
Two-way Automata and Regular Languages of Overlapping Tiles
In this paper, we show how the study of two-way automata on words may relevantly be extended to the study of two-way automata on one-dimensional overlapping tiles that generalize finite words. Indeed, over tiles, languages recognizable by finite two-way automata (resp. multi-pebble automata) coincide with languages definable by Kleene’s (resp. Kleene’s extended) regular expressions. As an immed...
متن کاملOn Practical Regular Expressions
We report on simulation, hierarchy, and decidability results for Practical Regular Expressions (PRE), which may include back references in addition to the standard operations union, concatenation, and star. The following results are obtained: • PRE can be simulated by the classical model of nondeterministic finite automata with sensing one-way heads. The number of heads depends on the number of...
متن کاملA NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA
In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...
متن کاملTranslation from classical two-way automata to pebble two-way automata
We study the relation between the standard two-way automata and more powerful devices, namely, two-way finite automata with an additional “pebble” movable along the input tape. Similarly as in the case of the classical two-way machines, it is not known whether there exists a polynomial trade-off, in the number of states, between the nondeterministic and deterministic pebble two-way automata. Ho...
متن کاملCharacterizations of one-way general quantum finite automata
Generally, unitary transformations limit the computational power of quantum finite automata (QFA). In this paper we study a generalized model named one-way general quantum finite automata (1gQFA), in which each symbol in the input alphabet induces a trace-preserving quantum operation, instead of a unitary transformation. Two different kinds of 1gQFA will be studied: measure-once one-way general...
متن کامل